The Complexity of Probabilistic versus Quantum Finite Automata
نویسنده
چکیده
We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1− ǫ for all ǫ > 0 with O(logn) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2 log n) states.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملCommunication complexity of promise problems and their applications to finite automata
Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [6] proved that the exact quantum communication complexity for a promise version of the equality problem is O(logn) while the classical deterministic communication co...
متن کاملPostselection Finite Quantum Automata
Postselection for quantum computing devices was introduced by S.Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson’s type postselection in quantum finite automata. There are several nonequivalent definitions of qua...
متن کاملThe Complexity of Probabilistic versus Deterministic Finite Automata
We show that there exists probabilistic finite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic finite automaton contains Ω(2 n log log n log n ) states.
متن کاملComplexity Bounds of Constant-Space Quantum Computation
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In particular, we show that, when the automata halt “in finite steps” along all computation paths, they must terminate in worstcase liner time. In the bounded-erro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002